Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges
نویسندگان
چکیده
منابع مشابه
Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges
Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the stock variables. We show that the convex hull of solutions of the discrete lot-sizing problem is obtain...
متن کاملLot-sizing with stock upper bounds and fixed charges
Here we study the discrete lot-sizing problem with an initial stock variable and an associated variable upper bound constraint. This problem is of interest in its own right, and is also a natural relaxation of the constant capacity lot-sizing problem with upper bounds and fixed charges on the stock variables. We show that the convex hull of solutions of the discrete lot-sizing problem is obtain...
متن کاملTwo-level lot-sizing with inventory bounds
We study a two-level uncapacitated lot-sizing problem with inventory bounds that occurs in a supply chain composed of a supplier and a retailer. The first level with the demands is the retailer level and the second one is the supplier level. The aim is to minimize the cost of the supply chain so as to satisfy the demands when the quantity of item that can be held in inventory at each period is ...
متن کاملA Note on "Lot-sizing with fixed charges on stocks: The convex hull"
We update and complete the proof of Proposition 7 in Van Vyve and Ortega (2004), which states that the projection of a facility location reformulation of an uncapacitated lot sizing problem with fixed charges on stocks (ULSW) to the original space is equivalent to that of the tight shortest path reformulation of ULSW. Their proof is interesting and consists of two cases, only first of which is ...
متن کاملLot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
We investigate the polyhedral structure of the lot-sizing problem with inventory bounds. We consider two models, one with linear cost on inventory, the other with linear and fixed costs on inventory. For both models, we identify facet-defining inequalities that make use of the inventory bounds explicitly and give exact separation algorithms. We also describe a linear programming formulation of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2011
ISSN: 0895-4801,1095-7146
DOI: 10.1137/11082556x